Robot Path Planning in Uncertain Environments: A Language-Measure-Theoretic Approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning in Uncertain Environments: A Language Measure-theoretic Approach

This paper addresses the problem of goal-directed robot path-planning in the presence of uncertainties that are induced by bounded environmental disturbances and actuation errors. The offline infinite-horizon optimal plan is locally updated by online finite-horizon adaptive re-planning upon observation of unexpected events (e.g., detection of unanticipated obstacles). The underlying theory is d...

متن کامل

A Mobile Robot Path-planning Approach under Unknown Environments

An inverse D* algorithm is presented in this paper for path-planning under unknown environments. In this inverse D* algorithm, the local potential energy around the current position is created firstly by defining the robot distance, then the leave point is searched to be regarded as the local goal position satisfying requirement of the rolling optimization. The leave point is searched locally a...

متن کامل

A Framework for Mobile Robot Concurrent Path Planning & Execution in Incomplete and Uncertain Environments

Sensor-based discovery path planning is problematic because the path needs to be continually recomputed as new information is discovered. A process-based clientserver approach is presented that permits concurrent sensor-based map and localization-correction updates as well as concurrent path computation and execution. Laplace’s equation is constantly solved (i.e., a harmonic function) by using ...

متن کامل

A Framework for Mobile Robot Concurrent Path Planning & Execution in Incomplete & Uncertain Environments

Sensor-based discovery path planning is problematic because the path needs to be continually recomputed as new information is discovered. A process-based client-server approach is presented that permits concurrent sensor-based map and localization-correction updates as well as concurrent path computation and execution. Laplace's equation is constantly solved (i.e., a harmonic function) by using...

متن کامل

An Overview of Optimal Graph Search Algorithms for Robot Path Planning in Dynamic or Uncertain Environments

Efficient path planning is critical to the development of useful autonomous robots, forming the glue between low-level sensory input and high-level objective completion. In this paper, we investigate two primary challenges: computing a path efficiently, and handling changes in the environment. The A* algorithm forms the foundation for solving the first problem, while D* and D* Lite solves the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamic Systems, Measurement, and Control

سال: 2014

ISSN: 0022-0434,1528-9028

DOI: 10.1115/1.4027876